Novel systolic architecture of fast biased polynomial transformWANG, S.-S; LIN, T.-P; WU, J.-L et al.International journal of mini & microcomputers. 1987, Vol 9, Num 1, pp 28-31, issn 0702-0481Article

An improved FPT algorithm for computing two-dimensional cyclic convolutionsREED, I. S; TRUONG, T. K; YEH, C.-S et al.IEEE transactions on acoustics, speech, and signal processing. 1983, Vol 31, Num 4, pp 1048-1050, issn 0096-3518Article

Fast biased polynomial transformsJA-LING WU; SOO-CHANG PEI.IEEE transactions on acoustics, speech, and signal processing. 1986, Vol 34, Num 2, pp 383-385, issn 0096-3518Article

On the computation of autocorrelation using polynomial transformsPRAKASH, S; RAO, V. V.IEEE transactions on acoustics, speech, and signal processing. 1984, Vol 32, Num 2, pp 448-450, issn 0096-3518Article

NP-hardness of the cluster minimization problem revisitedADIB, Artur B.Journal of physics. A, mathematical and general. 2005, Vol 38, Num 40, pp 8487-8492, issn 0305-4470, 6 p.Article

Computing configuration space obstacles using polynomial transformsWENJIE SHU; ZHIQIANG ZHENG.IEEE International Conference on Robotics and Automation. 2004, pp 3920-3924, isbn 0-7803-8232-3, 5Vol, 5 p.Conference Paper

Improved long convolutions using generalized number theoretic and polynomial transformsSOO-CHANG PEI; JA-LING WU.IEEE transactions on acoustics, speech, and signal processing. 1985, Vol 33, Num 6, pp 1626-1627, issn 0096-3518Article

Fast biased polynomial transforms for 2D prime lengths discrete Fourier TransformsJA-LING WU; SOO-CHANG PEI.Electronics Letters. 1984, Vol 20, Num 22, pp 933-934, issn 0013-5194Article

Variable transformations in the numerical solution of second kind Volterra integral equations with continuous and weakly singular kernels; extensions to Fredholm integral equationsGALPERIN, E. A; KANSA, E. J; MAKROGLOU, A et al.Journal of computational and applied mathematics. 2000, Vol 115, Num 1-2, pp 193-211, issn 0377-0427Conference Paper

FILTRAGE NUMERIQUE RAPIDE PAR TRANSFORMEES DE FOURIER ET TRANSFORMEES POLYNOMIALES: ETUDE DE L'IMPLANTATION SUR MICROPROCESSEURSQUANDALLE PHILIPPE.1979; ; FRA; DA. 1979; 286; 166-24 P.; 30 CM; BIBL. 20 REF.; TH. 3EME CYCLE: MATH./MICE/1979Thesis

FLEXIBILITY IN THE LENGTH OF CONVOLUTIONS COMPUTED USING FOURIER-LIKE FAST TRANSFORM ALGORITHMSARAMBEPOLA B; RAYNER PJW.1980; SIGNAL PROCESS; NLD; DA. 1980; VOL. 2; NO 1; PP. 31-38; ABS. GER/FRE; BIBL. 14 REF.Article

FAST BIASED POLYNOMIAL TRANSFORMS FOR TWO-DIMENSIONAL CONVOLUTIONSSOO CHANG PEI; JA LING WU.1981; ELECTRON. LETT.; ISSN 0013-5194; GBR; DA. 1981; VOL. 17; NO 15; PP. 547-548; BIBL. 4 REF.Article

INSTABILITY OF AN AREA-PRESERVING POLYNOMIAL MAPPING.BARTLETT JH.1978; CELEST. MECH.; NLD; DA. 1978; VOL. 17; NO 1; PP. 3-36; BIBL. 15 REF.Article

A note on the polynomial form of Boolean functions and related topicsFALKOWSKI, B. J.IEEE transactions on computers. 1999, Vol 48, Num 8, pp 860-864, issn 0018-9340Article

A set of one-to-one two-dimensional biquadratic transformationsGE, Y.-R; FITZPATRICK, J. M.Computers & mathematics with applications (1987). 1994, Vol 27, Num 11, pp 13-25, issn 0898-1221Article

Improved fast polynomial transform algorithm for cyclic convolutionsMING LOH, A; WAN-CHI SIU.Circuits, systems, and signal processing. 1995, Vol 14, Num 5, pp 603-614, issn 0278-081XArticle

Discrete convolution calculation algorithms employing number-theoretic transformations in single-modulus and multimodulus residue arithmeticSHATALOV, A. A.Telecommunications & radio engineering. 1993, Vol 48, Num 1, pp 28-33, issn 0040-2508Article

Design of state-variable SC filters by means of polynomial transformationDAVIS, A. M; SMITH, R. R.IEEE transactions on circuits and systems. 1986, Vol 33, Num 12, pp 1248-1251, issn 0098-4094Article

Theory and design of multidimensional QMF sub-band filters from 1-D filters and polynomials using transformsSHAH, I. A; KALKER, A. A. C.IEE proceedings. I. Communications, speech and vision. 1993, Vol 140, Num 1, pp 67-71, issn 0956-3776Article

Recursive computation of polynomial transform coefficientsPHILIPS, W.Electronics Letters. 1991, Vol 27, Num 25, pp 2337-2339, issn 0013-5194Article

Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial ringsMARTENS, J.-B.IEEE transactions on acoustics, speech, and signal processing. 1984, Vol 32, Num 4, pp 862-871, issn 0096-3518Article

An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transformsCHENG LIZHI; JIANG ZENGRONG.Circuits, systems, and signal processing. 2001, Vol 20, Num 1, pp 77-88, issn 0278-081XArticle

On constructing regular filter banks from domain bounded polynomialsTOLHUIZEN, L. M. G. M; SHAH, I. A; KALKER, A. A. C. M et al.IEEE transactions on signal processing. 1994, Vol 42, Num 2, pp 451-456, issn 1053-587XArticle

Complementary transformation ― A group theory point of viewONETE, C. E.International journal of circuit theory and applications. 1985, Vol 13, Num 4, pp 349-353, issn 0098-9886Article

A new fast algorithm of Mersenne Transform and it applicationLIU LIANG; SUN QI.International Conference on Signal Processing. 2004, pp 113-116, isbn 0-7803-8406-7, 4 p.Conference Paper